Paving the way for Large-Scale Combinatorial Auctions
نویسندگان
چکیده
The Winner Determination Problem (WDP) in Combinatorial Auctions comes up in a wide range of applications. Linear Programming (LP) relaxations are a standard method for approximating combinatorial optimisation problems. In this paper we propose how to encode the WDP so that it can be approximated with AD. Moreover, we contribute with PAR-AD, the first parallel implementation of AD. We show that while AD is up to 4.6 times faster than CPLEX in a single-thread execution, PAR-AD is up to 23 times faster than parallel CPLEX in an 8-core architecture.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملParallelisation and Application of AD 3 as a Method for Solving Large Scale Combinatorial Auctions
Auctions, and combinatorial auctions (CAs), have been successfully employed to solve coordination problems in a wide range of application domains. However, the scale of CAs that can be optimally solved is small because of the complexity of the winner determination problem (WDP), namely of finding the bids that maximise the auctioneer’s revenue. A way of approximating the solution of a WDP is to...
متن کاملVery-Large-Scale Generalized Combinatorial Multi-Attribute Auctions: Lessons from Conducting $60 Billion of Sourcing
Drawing from our experiences of designing and fielding over 800 sourcing auctions totaling over $60 billion, I will discuss issues that arise in very-large-scale generalized combinatorial auctions, as well as solutions that work (and ones that do not). These are by far the largest (in terms of the number of items as well as the number of side constraints) and most complex combinatorial markets ...
متن کاملAn adaptive bidding strategy for combinatorial auctions-based resource allocation in dynamic markets
Combinatorial auctions, where bidders are allowed to submit bids for bundles of items, are preferred to single-item auctions when bidders have complementarities and substitutabilities among items and therefore achieve better social efficiency. A large unexplored area of research is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auct...
متن کامل